Pattern Avoidance in Ordered Set Partitions
نویسندگان
چکیده
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for certain special cases, and a recursive technique to exactly enumerate the appropriate set partitions in general. We also give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; including a Stanely-Wilf type result bounding such growth rates.
منابع مشابه
Left-right arrangements, set partitions, and pattern avoidance
We show structural properties of the system of ordered partitions of [n] := {1, . . . , n} all of whose left-to-right minima occur in odd locations, called left-to-right arrangements. Our main objectives are (i) to show that the set of all finite left-to-right arrangements is a projective system under a natural choice of restriction operation, (ii) to establish a non-trivial embedding of set pa...
متن کاملAVOIDANCE OF PARTIALLY ORDERED PATTERNS OF THE FORM k-σ-k
Sergey Kitaev [4] has shown that the exponential generating function for permutations avoiding the generalized pattern σ-k, where σ is a pattern without dashes and k is one greater than the largest element in σ, is determined by the exponential generating function for permutations avoiding σ. We show that the exponential generating function for permutations avoiding the partially ordered patter...
متن کاملAvoiding Colored Partitions of Lengths Two and Three
Pattern avoidance in the symmetric group Sn has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work [3, 9, 10, 11] has generalized these results to Sn o Cc, the objects of which can be viewed as “colored permutations”. Another body of research that has grown from the study of pattern avoidance in permutations is patt...
متن کاملSingleton free set partitions avoiding a 3-element set
The definition and study of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations, begun with Klazar. Sagan continued his work by considering set partitions which avoids a single partition of three elements, and Goyt generalized these results by considering partitions which avoids any family of partitions of a 3-element set. In this paper we enumerate ...
متن کاملAsymptotics of Pattern Avoidance in the Klazar Set Partition and Permutation-Tuple Settings
Definition. A set partition is a partition of the set [n] for some n into any number of nonempty sets, where the order within the partition is irrelevant. We call these sets blocks of the partition. The number of set partitions of [n] is the Bell number Bn. Often, when writing specific set partitions, we will write the partition [n] = S1 ∪ · · · ∪ Sk as S1/ · · · /Sk, where the Si are in increa...
متن کامل